Deciding polynomial-transcendental problems

نویسندگان

  • Scott McCallum
  • Volker Weispfenning
چکیده

This paper presents a decision procedure for a certain class of sentences of first order logic involving integral polynomials and a certain specific analytic transcendental function trans(x) in which the variables range over the real numbers. The list of transcendental functions to which our decision method directly applies includes exp(x), the exponential function with respect to base e, ln(x), the natural logarithm of x, and arctan(x), the inverse tangent function. The inputs to the decision procedure are prenex sentences in which only the outermost quantified variable can occur in the transcendental function. In the case trans(x) = exp(x), the decision procedure has been implemented in the computer logic system REDLOG. It is shown how to transform a sentence involving a transcendental function from a much wider collection of functions (such as hyperbolic and Gaussian functions, and trigonometric functions on a certain bounded interval) into a sentence to which our decision method directly applies. Closely related work is reported by Anai and Weispfenning (2000), Collins (1998), Maignan (1998), Richardson (1991), Strzebonski (2011) and Weispfenning (2000).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Determination of a Matrix Function in the Form of f(A)=g(q(A)) Where g(x) Is a Transcendental Function and q(x) Is a Polynomial Function of Large Degree Using the Minimal Polynomial

Matrix functions are used in many areas of linear algebra and arise in numerical applications in science and engineering. In this paper, we introduce an effective approach for determining matrix function f(A)=g(q(A)) of a square matrix A, where q is a polynomial function from a degree of m and also function g can be a transcendental function. Computing a matrix function f(A) will be time- consu...

متن کامل

Rootfinding for a transcendental equation without a first guess: Polynomialization of Kepler’s equation through Chebyshev polynomial expansion of the sine

The Kepler equation for the parameters of an elliptical orbit, E−ε sin(E)=M , is reduced from a transcendental to a polynomial equation by expanding the sine as a series of Chebyshev polynomials. The single real root is found by applying standard polynomial rootfinders and accepting only the polynomial root that lies on the interval predicted by rigorous theoretical bounds. A complete Matlab im...

متن کامل

Verifying Hybrid Systems Involving Transcendental Functions

We explore uses of a link we have constructed between the KeYmaera hybrid systems theorem prover and the MetiTarski proof engine for problems involving special functions such as sin, cos, exp, etc. Transcendental functions arise in the specification of hybrid systems and often occur in the solutions of the differential equations that govern how the states of hybrid systems evolve over time. To ...

متن کامل

Gröbner Bases Applied to Finitely Generated Field Extensions

Let k(~x) := k(x1, . . . , xn) be a finitely generated extension field of some field k, and denote by k(~g) := k(g1, . . . , gr) an intermediate field of k(~x)/k generated over k by some elements g1, . . . , gr ∈ k(~x). So geometrically, we may take ~g for rational functions on the variety determined by the generic point (~x). To determine whether the extension k(~x)/k(~g) is transcendental or ...

متن کامل

Complete Problems for Monotone NP

We show that the problem of deciding whether a digraph has a Hamiltonian path between two specified vertices and the problem of deciding whether a given graph has a cubic subgraph are complete for monotone NP via monotone projection translations. We also show that the problem of deciding whether a uniquely partially orderable (resp. comparability) graph has a cubic subgraph is complete for NP v...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Symb. Comput.

دوره 47  شماره 

صفحات  -

تاریخ انتشار 2012